A note on well quasi-orderings for powersetsJANCAR, P.Information processing letters. 1999, Vol 72, Num 5-6, pp 155-160, issn 0020-0190Article

Bisimulation equivalence is decidable for one-counter processesJANCAR, P.Lecture notes in computer science. 1997, pp 549-559, issn 0302-9743, isbn 3-540-63165-8Conference Paper

Techniques for decidability and undecidability of bisimilarityJANCAR, P; MOLLER, F.Lecture notes in computer science. 1999, pp 30-45, issn 0302-9743, isbn 3-540-66425-4Conference Paper

Deciding bisimulation-like equivalences with finite-state processesJANCAR, P; KUCERA, A; MAYR, R et al.Lecture notes in computer science. 1998, pp 200-211, issn 0302-9743, isbn 3-540-64781-3Conference Paper

Undecidability of bisimilarity for Petri nets and some related problemsJANCAR, P.Theoretical computer science. 1995, Vol 148, Num 2, pp 281-301, issn 0304-3975Conference Paper

Simulation and bisimulation over one-counter processesJANCAR, P; KUCERA, A; MOLLER, F et al.Lecture notes in computer science. 2000, pp 334-345, issn 0302-9743, isbn 3-540-67141-2Conference Paper

Simulation problems for one-counter machinesJANCAR, P; MOLLER, F; SAWA, Z et al.Lecture notes in computer science. 1999, pp 404-413, issn 0302-9743, isbn 3-540-66694-XConference Paper

Monotonic rewriting automata with a restart operationMRAZ, F; PLATEK, M; JANCAR, P et al.Lecture notes in computer science. 1997, pp 505-512, issn 0302-9743, isbn 3-540-63774-5Conference Paper